The Fluid Limit of an Overloaded Processor Sharing Queue
نویسندگان
چکیده
This paper primarily concerns strictly supercritical fluid models, which arise as functional law of large numbers approximations for overloaded processor sharing queues. Analogous results for critical fluid models associated with heavily loaded processor sharing queues are contained in Gromoll et al. [9] and Puha and Williams [15]. An important distinction between critical and strictly supercritical fluid models is that the total mass for a solution that starts from zero grows with time for the latter, but it is identically equal to zero for the former. For strictly supercritical fluid models, this paper contains descriptions of each of the following: the distribution of the mass as it builds up from zero, the set of stationary solutions, and the limiting behavior of an arbitrary solution as time tends to infinity. In addition, a fluid limit result is proved that justifies strictly supercritical fluid models as first order approximations to overloaded processor sharing queues.
منابع مشابه
The fluid limit of the multiclass processor sharing queue
Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian processor sharing discipline. Building on prior work by Gromoll et al. [1...
متن کاملPopulation effects in multiclass processor sharing queues
Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian or the discriminatory processor sharing discipline. In this paper, we con...
متن کاملLaw of Large Number Limits of Limited Processor-Sharing Queues
Motivated by applications in computer and communication systems, we consider a processor sharing queue where the number of jobs served is not larger than K. We propose a measure-valued fluid model for this limited processor sharing queue and show that there exists a unique associated fluid model solution. In addition, we show that this fluid model arises as the limit of a sequence of appropriat...
متن کاملFluid and Heavy Traffic Diffusion Limits for a Generalized Processor Sharing Model By
Under fairly general assumptions on the arrival and service time processes, we prove fluid and heavy traffic limit theorems for the unfinished work, queue length, sojourn time and waiting time processes associated with a single station multiclass generalized processor sharing model. The fluid limit of the unfinished work process is characterized by the Skorokhod map associated with a Skorokhod ...
متن کاملFluid approximations for a processor-sharing queue
This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 31 شماره
صفحات -
تاریخ انتشار 2006